New Berry–Esseen bounds for functionals of binomial point processes
نویسندگان
چکیده
منابع مشابه
Deviation Bounds for Additive Functionals of Markov Processes
where X is a μ stationary and ergodic Markov process and V is some μ integrable function. These bounds are obtained under various moments assumptions for V , and various regularity assumptions for μ. Regularity means here that μ may satisfy various functional inequalities (F-Sobolev, generalized Poincaré etc...).
متن کاملLimit theorems for geometric functionals of Gibbs point processes
Observations are made on a point process Ξ in R in a window Qλ of volume λ. The observation, or ‘score’ at a point x, here denoted ξ(x, Ξ), is a function of the points within a random distance of x. When the input Ξ is a Poisson or binomial point process, the large λ limit theory for the total score ∑ x∈Ξ∩Qλ ξ(x, Ξ ∩Qλ), when properly scaled and centered, is well understood. In this paper we es...
متن کاملNormal approximation for coverage models over binomial point processes
We give error bounds which demonstrate optimal rates of convergence in the CLT for the total covered volume and the number of isolated shapes, for germ-grain models with fixed grain radius over a binomial point process of n points in a toroidal spatial region of volume n. The proof is based on Stein’s method via size-biased couplings. 1 Department of Mathematics, University of Southern Californ...
متن کاملThe Variance of a New Class of N-point Correlation Estimators in Poisson and Binomial Point Processes
We describe a set of new estimators for the N-point correlation functions of point processes. The variance of these estimators is calculated for the Poisson and binomial cases. It is shown that the variance of the unbiased estimator converges to the continuum value much faster than with any previously used alternative, all terms with slower convergence exactly cancel. We compare our estimators ...
متن کاملRegularity Bounds for Binomial Edge Ideals
We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2017
ISSN: 1050-5164
DOI: 10.1214/16-aap1218